Sequent Calculi for Branching Time Temporal Logics of Knowledge and Belief
نویسنده
چکیده
In this paper we consider branching time temporal logics of knowledge and belief. These logics involve the discrete time linear temporal logic operators “next” and “until” with the branching temporal logic operator “on all paths”. The latter operator is interpreted with respect to a version of the bundle semantics. In addition the temporal logic of knowledge (belief) contains an indexed set of unary modal operators “agent i knows” (“agent i believes”) and it contains the modality of common knowledge (belief). For these logics we present sequent calculi with a restricted cut rule. Thus, we get proof systems where proof-search becomes decidable. The soundness and completeness for these calculi are proved.
منابع مشابه
Sequent Calculi for Temporal Logics of Common Knowledge and Belief
In this paper we consider two logics: temporal logic of common knowledge and temporal logic of common belief. These logics involve the discrete time linear temporal logic operators “next” and “until”. In addition the first logic contains an indexed set of unary modal operators “agent i knows”, the second one contains an indexed set of unary modal operators “agent i believes”. Also the first log...
متن کاملBunched Logics Displayed
We formulate a unified display calculus proof theory for the four principal varieties of bunched logic by combining display calculi for their component logics. Our calculi satisfy cut-elimination, and are sound and complete with respect to their standard presentations. We show how to constrain applications of display-equivalence in our calculi in such a way that an exhaustive proof search need ...
متن کاملModularisation of Sequent Calculi for Normal and Non-normal Modalities
In this work we explore the connections between (linear) nested sequent calculi and ordinary sequent calculi for normal and non-normal modal logics. By proposing local versions to ordinary sequent rules we obtain linear nested sequent calculi for a number of logics, including to our knowledge the first nested sequent calculi for a large class of simply dependent multimodal logics, and for many ...
متن کاملCompleteness of a First-Order Temporal Logic with Time-Gaps
The rst-order temporal logics with 2 and of time structures isomorphic to ! (discrete linear time) and trees of !-segments (linear time with branching gaps) and some of its fragments are compared: The rst is not recursively axiomatizable. For the second, a cut-free complete sequent calculus is given, and from this, a resolution system is derived by the method of Maslov.
متن کاملNested Sequent Calculi and Theorem Proving for Normal Conditional Logics
In this paper we focus on proof methods and theorem proving for normal conditional logics, by describing nested sequent calculi as well as a theorem prover for them. Nested sequent calculi are a useful generalization of ordinary sequent calculi, where sequents are allowed to occur within sequents. Nested sequent calculi have been profitably employed in the area of (multi)-modal logic to obtain ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Informatica, Lith. Acad. Sci.
دوره 18 شماره
صفحات -
تاریخ انتشار 2007